Subset sum problems with digraph constraints
نویسندگان
چکیده
منابع مشابه
Subset Sum Problems With Digraph Constraints
We introduce and study four optimization problems that generalize the well-known subset sum problem. Given a node-weighted digraph, select a subset of vertices whose total weight does not exceed a given budget. Some additional constraints need to be satisfied. The (weak resp.) digraph constraint imposes that if (all incoming nodes of resp.) a node x belongs to the solution, then the latter comp...
متن کاملDuality for vector equilibrium problems with constraints
In the paper, we study duality for vector equilibrium problems using a concept of generalized convexity in dealing with the quasi-relative interior. Then, their applications to optimality conditions for quasi-relative efficient solutions are obtained. Our results are extensions of several existing ones in the literature when the ordering cones in both the objective space and the constr...
متن کاملBranching proofs of infeasibility in low density subset sum problems
We prove that the subset sum problem ax = β x ∈ {0, 1}n (SUB) has a polynomial time computable certificate of infeasibility for all a with density at most 1/(2n), and for almost all β integer right hand sides. The certificate is branching on a hyperplane, i.e. by a methodology dual to the one explored by Lagarias and Odlyzko [6]; Frieze [3]; Furst and Kannan [4]; and Coster et. al. in [1]. We p...
متن کاملA Quantum Approach to Subset-Sum and Similar Problems
In this paper, we study the subset-sum problem by using a quantum heuristic approach similar to the verification circuit of quantum Arthur-Merlin games [1]. Under described certain assumptions, we show that the exact solution of the subset sum problem my be obtained in polynomial time and the exponential speed-up over the classical algorithms may be possible. We give a numerical example and dis...
متن کاملLaced Boolean functions and subset sum problems in finite fields
In this paper, we investigate some algebraic and combinatorial properties of a special Boolean function on n variables, defined using weighted sums in the residue ring modulo the least prime p ≥ n. We also give further evidence to a question raised by Shparlinski regarding this function, by computing accurately the Boolean sensitivity, thus settling the question for prime number values p = n. F...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2018
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-018-0262-1